mmdt: multi-objective memetic rule learning from decision tree
نویسندگان
چکیده
in this article, a multi-objective memetic algorithm (ma) for rule learning is proposed. prediction accuracy and interpretation are two measures that conflict with each other. in this approach, we consider accuracy and interpretation of rules sets. additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. this article proposed a way to handle imbalance classes’ distribution. we introduce multi-objective memetic rule learning from decision tree (mmdt). this approach partially solves the problem of class imbalance. moreover, a ma is proposed for refining rule extracted by decision tree. in this algorithm, a particle swarm optimization (pso) is used in ma. in refinement step, the aim is to increase the accuracy and ability to interpret. mmdt has been compared with part, c4.5 and dtga on numbers of data sets from uci based on accuracy and interpretation measures. results show mmdt offers improvement in many cases.
منابع مشابه
MMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملMulti-objective Optimization for Incremental Decision Tree Learning
Decision tree learning can be roughly classified into two categories: static and incremental inductions. Static tree induction applies greedy search in splitting test for obtaining a global optimal model. Incremental tree induction constructs a decision model by analyzing data in short segments; during each segment a local optimal tree structure is formed. Very Fast Decision Tree [4] is a typic...
متن کاملMMDT: a multi-valued and multi-labeled decision tree classifier for data mining
We have proposed a decision tree classifier named MMC (multi-valued and multi-labeled classifier) before. MMC is known as its capability of classifying a large multi-valued and multi-labeled data. Aiming to improve the accuracy of MMC, this paper has developed another classifier named MMDT (multi-valued and multi-labeled decision tree). MMDT differs from MMC mainly in attribute selection. MMC a...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملMulti-Objective Decision Making
Many real-world tasks require making decisions that involve multiple possibly conflicting objectives. To succeed in such tasks, intelligent systems need planning or learning algorithms that can e ciently find di↵erent ways of balancing the trade-o↵s that such objectives present. In this tutorial, we provide an introduction to decision-theoretic approaches to coping with multiple objectives. We ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of computer and roboticsجلد ۷، شماره ۲، صفحات ۳۷-۴۶
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023